Further Results on Square Sum Graph
نویسندگان
چکیده
A (p, q) graph G is said to be square sum, if there exists a bijection f : V (G) → {0, 1, 2, . . . , p − 1} such that the induced function f∗ : E(G)→ N defined by f∗(uv) = (f(u))2 + (f(v))2, for every uv ∈ E(G) is injective. In this paper we establish that if G is a square sum graph then G∪Pm is square sum, (Km,n) is square sum if and only if m+n ≤ 5 and W 2 n is square sum if and only if n ≤ 5. We proved that shadow graph and split graph of Pn and K1,n are square sum for every n ∈ N. Also union of paths, the sequential join of some classes of square sum graph, mK1,n for m,n ∈ N and Pn K2(attaching K2 to each vertex of Pn) are some classes of square sum graphs.
منابع مشابه
The Sum Graph of Non-essential Submodules
Throughout this paper, R will denote a commutative ring with identity and M is a unitary R- module and Z will denote the ring of integers. We introduce the graph Ω(M) of module M with the set of vertices contain all nontrivial non-essential submodules of M. We investigate the interplay between graph-theoretic properties of Ω(M) and algebraic properties of M. Also, we assign the values of natura...
متن کاملWiener Index of Graphs in Terms of Eccentricities
The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all unordered pairs of vertices of G. The eccentricity of a vertex v in G is the distance to a vertex farthest from v. In this paper we obtain the Wiener index of a graph in terms of eccentricities. Further we extend these results to the self-centered graphs.
متن کاملThe sum-annihilating essential ideal graph of a commutative ring
Let $R$ be a commutative ring with identity. An ideal $I$ of a ring $R$is called an annihilating ideal if there exists $rin Rsetminus {0}$ such that $Ir=(0)$ and an ideal $I$ of$R$ is called an essential ideal if $I$ has non-zero intersectionwith every other non-zero ideal of $R$. Thesum-annihilating essential ideal graph of $R$, denoted by $mathcal{AE}_R$, isa graph whose vertex set is the set...
متن کاملOn sum coloring and sum multi-coloring for restricted families of graphs
We consider the sum coloring (chromatic sum) and sum multi-coloring problems for restricted families of graphs. In particular, we consider the graph classes of proper intersection graphs of axis-parallel rectangles, proper interval graphs, and unit disk graphs. All the above mentioned graph classes belong to a more general graph class of (k+1)clawfree graphs (respectively, for k = 4, 2, 5). We ...
متن کاملLaplacian Energy of a Fuzzy Graph
A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...
متن کامل